Orthogonal Matrix in Cryptography
نویسنده
چکیده
In this work is proposed a method using orthogonal matrix transform properties to encrypt and decrypt a message. It will be showed how to use matrix’s functions to create complex encryptions. Because orthogonal matrix are always diagonalizable on R, and the exponential of a diagonal matrix is easy to compute, the exponential of orthogonal matrix will be used to encrypt text messages.
منابع مشابه
On the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is avoided, by simply using the transpose of the orthogonal matrix. In this pa...
متن کاملOn the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint
This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملTwo-weight codes, graphs and orthogonal arrays
We investigate properties of two-weight codes over finite Frobenius rings, giving constructions for the modular case. A δ-modular code [15] is characterized as having a generator matrix where each column g appears with multiplicity δ|gR×| for some δ ∈ Q. Generalizing [10] and [5], we show that the additive group of a two-weight code satisfying certain constraint equations (and in particular a m...
متن کاملA copyright protection scheme for digital images based on shuffled singular value decomposition and visual cryptography
This paper proposes a new watermarking algorithm based on the shuffled singular value decomposition and the visual cryptography for copyright protection of digital images. It generates the ownership and identification shares of the image based on visual cryptography. It decomposes the image into low and high frequency sub-bands. The low frequency sub-band is further divided into blocks of same ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.5787 شماره
صفحات -
تاریخ انتشار 2014